On an algorithm for discrete nonlinear L1 approximation

Huber Approximation for the Nonlinear l1 Problem

An Approximation Algorithm for the Discrete Team Decision Problem

Abstract. In this paper we study a discrete version of the classical team decision problem. It has been shown previously that the general discrete team decision problem is NP-hard. Here we present an efficient approximation algorithm for this problem. For the maximization version of this problem with nonnegative rewards, this algorithm computes decision rules which are guaranteed to be within a...

Unicity in piecewise polynomial L1-approximation via an algorithm

Our main result shows that certain generalized convex functions on a real interval possess a unique best L1 approximation from the family of piecewise polynomial functions of fixed degree with varying knots. This result was anticipated by Kioustelidis in [11]; however the proof given there is nonconstructive and uses topological degree as the primary tool, in a fashion similar to the proof the ...

An Algorithm for Multi-Realization of Nonlinear MIMO Systems

This paper presents a theoretical approach to implementation of the “Multi-realization of nonlinear MIMO systems”. This method aims to find state-variable realization for a set of systems, sharing as many parameters as possible. In this paper a special nonlinear multi-realization problem, namely the multi-realization of feedback linearizable nonlinear systems is considered and an algorithm for ...

Approximation algorithm for the L1-fitting circle problem

In this paper, we study the problem of L1-fitting a circle to a set of points in the plane, where the target function is the sum of distances of the points to the circle. We show an (1 + ε)-approximation algorithm, with running time O(n + poly(log n, 1/ε)), where poly(log n, 1/ε) is a constant degree polynomial in log n and 1/ε. This is the first subquadratic algorithm for this problem.